NEW SUPERVISORY CONTROL USING CONTROL-RELEVANT SWITCHING
نویسندگان
چکیده
منابع مشابه
New Supervisory Control Using Control-relevant Switching
This paper presents a new supervisory control scheme, which is based on a control-relevant switching logic. Unlike most of the existing switching methods considering only estimator performance, the proposed scheme takes both estimator and controller performance into account. As an index to the controller performance, an iISS (integral-Input-to-State Stability) Lyapunov function is employed; it ...
متن کاملEnhancement of Robust Tracking Performance via Switching Supervisory Adaptive Control
When the process is highly uncertain, even linear minimum phase systems must sacrifice desirable feedback control benefits to avoid an excessive ‘cost of feedback’, while preserving the robust stability. In this paper, the problem of supervisory based switching Quantitative Feedback Theory (QFT) control is proposed for the control of highly uncertain plants. According to this strategy, the unce...
متن کاملSupervisory control using control objectives
We study the supervisory control problem for closed languages when the specifications are given in terms of control objectives i.e. a pairing of predicates associated with blocking events. We show that under some conditions the supervisory control problem is decidable for non-regular languages and results in obtaining the least restrictive behavior. The result appears to give an extension of th...
متن کاملDecentralized Supervisory Control Using Dynamic Default Control
The conventional decentralized supervisory control architectures for discrete event systems assume that default control of controllable events is static. In this paper, we propose a new decentralized supervisory control architecture using dynamic default control of controllable events. We present necessary and sufficient conditions for the existence of a decentralized supervisor in the proposed...
متن کاملOn the computation of supremal sublanguages relevant to supervisory control
Given a specification language, this paper discusses an iterative procedure for the computation of the supremal sublanguage, that possesses a conjunction of certain closed-loop properties, including controllability, normality and completeness. The iteration is stated in terms of (i) supremal sublanguage operators for each individual property, (ii) prefix-closures, and, (iii) language intersecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2005
ISSN: 1474-6670
DOI: 10.3182/20050703-6-cz-1902.00236